Overlap and Add algorithm for fast convolution of long array#695
Overlap and Add algorithm for fast convolution of long array#695eleroy wants to merge 4 commits intov923z:masterfrom
Conversation
|
I'm a bit confused: we agreed that |
|
Pff...sorry i forgot to move the method to signal, left it where i built it in filter. I also saw it didn't built since i added the m_free that was not well used (IS it useful to free the buffer at the end or it will be free anyway when the method returns?) I'll modify the PR to address your remarks. |
|
And I think that the problem of complexes has to be solved. It wouldn't make sense to include complex support for the sake of a single method. |
In this case, it shouldn't really matter. |
…t complex. It should also work if there is no complex support. Revert filter+numpy changes
|
added:
|
| @@ -2,9 +2,10 @@ | |||
| scipy.signal | |||
There was a problem hiding this comment.
The documentation is actually generated from this: https://github.com/v923z/micropython-ulab/blob/master/docs/scipy-signal.ipynb. The jupyter notebook allows you to run micropython code directly, so you don't have to copy anything.
There was a problem hiding this comment.
Ha ok, I made the changes in the jupyter notebook but I'm not sure how to run it (my system is windows).
Many thanks! I think it's almost ready to go. I added a couple of small comments. If those can be resolved, this could be merged. |
Hi everyone,
This an implementation of the oaconvolve method that may be faster than convolve espiecielly when dealing with long arrays.
Few things I'm not sure:
The method takes the same arguments as the convolve method.